Generalized Dyck tilings (Extended Abstract)

نویسندگان

  • Matthieu Josuat-Vergès
  • Jang Soo Kim
  • Matthieu Josuat-Vergés
چکیده

Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The first goal of this work is to give an alternative point of view on Dyck tilings by making use of the weak order and the Bruhat order on permutations. Then we introduce two natural generalizations: k-Dyck tilings and symmetric Dyck tilings. We are led to consider Stirling permutations, and define an analogue of the Bruhat order on them. We show that certain families of k-Dyck tilings are in bijection with intervals in this order. We enumerate symmetric Dyck tilings and show that certain families of symmetric Dyck tilings are in bijection with intervals in the weak order on signed permutations. Résumé. Récemment, Kenyon et Wilson ont introduit les pavages de Dyck, qui sont des pavages de la région comprise entre deux chemins de Dyck. L’énumération des pavages de Dyck est reliée aux formules d’équerre sur les forêts et à la combinatoire des polynômes de Hermite. Le premier but de ce travail est de donner un point de vue alternatif sur les pavages de Dyck, en utilisant l’ordre faible et l’ordre de Bruhat sur les permutations. Nous introduisons ensuite deux généralisations naturelles: les k-pavages de Dyck et les pavages de Dyck symétriques. Nous sommes amenés à considérer les permutations de Stirling, et définissons un analogue de l’ordre de Bruhat. Nous montrons que certaines familles de k-pavages de Dyck sont en bijection avec des intervalles de cet ordre. Nous énumérons les pavages de Dyck symétriques et montrons que certaines familles de pavages de Dyck symétriques sont en bijection avec des intervalles de l’ordre faible sur les permutations signées.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dyck tilings , linear extensions , descents , and inversions ( extended abstract )

Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths. We give two bijections between “cover-inclusive” Dyck tilings and linear extensions of tree posets. The first bijection maps the statistic (area + tiles)/2 to inversions of the linear extension, and the seco...

متن کامل

Proofs of two conjectures of Kenyon and Wilson on Dyck tilings

Recently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probabilities of what they call the double-dimer model. They showed that the absolute value of each entry of the inverse matrix M−1 is equal to the number of certain Dyck tilings of a skew shape. They conjectured two formulas on the sum of the absolute values of the entries in a row or a column of M−1. In this...

متن کامل

Staircase Tilings and Lattice Paths

We define a combinatorial structure, a tiling of the staircase in the R plane, that will allow us, when restricted in different ways, to create direct bijections to Dyck paths of length 2n, Motzkin paths of lengths n and n−1, as well as Schröder paths and little Schröder paths of length n.

متن کامل

ar X iv : 0 80 5 . 12 73 v 1 [ m at h . C O ] 9 M ay 2 00 8 BELL POLYNOMIALS AND k - GENERALIZED DYCK PATHS

Abstract. A k-generalized Dyck path of length n is a lattice path from (0, 0) to (n, 0) in the plane integer lattice Z × Z consisting of horizontal-steps (k, 0) for a given integer k ≥ 0, up-steps (1, 1), and down-steps (1,−1), which never passes below the x-axis. The present paper studies three kinds of statistics on k-generalized Dyck paths: ”number of u-segments”, ”number of internal u-segme...

متن کامل

Representing Real Numbers in a Generalized Numeration Systems

We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider representations of real numbers using the Dyck language. We also show that our framework can be applied to the rational base numeration systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014